Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
app(app(app(compose, f), g), x) → app(f, app(g, x))
Q is empty.
↳ QTRS
↳ RRRPoloQTRSProof
Q restricted rewrite system:
The TRS R consists of the following rules:
app(app(app(compose, f), g), x) → app(f, app(g, x))
Q is empty.
The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:
app(app(app(compose, f), g), x) → app(f, app(g, x))
Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:
app(app(app(compose, f), g), x) → app(f, app(g, x))
Used ordering:
Polynomial interpretation [25]:
POL(app(x1, x2)) = 2·x1 + x2
POL(compose) = 1
↳ QTRS
↳ RRRPoloQTRSProof
↳ QTRS
↳ RisEmptyProof
Q restricted rewrite system:
R is empty.
Q is empty.
The TRS R is empty. Hence, termination is trivially proven.